An Ensemble Surrogate-Based Framework for Expensive Multiobjective Evolutionary Optimization

نویسندگان

چکیده

Surrogate-assisted evolutionary algorithms (SAEAs) have become very popular for tackling computationally expensive multiobjective optimization problems (EMOPs), as the surrogate models in SAEAs can approximate EMOPs well, thereby reducing time cost of process. However, with increased number decision variables EMOPs, prediction accuracy will deteriorate, which inevitably worsens performance SAEAs. To deal this issue, article suggests an ensemble surrogate-based framework EMOPs. In framework, a global model is trained under entire search space to explore area, while submodels are different subspaces exploit subarea, so enhance and reliability. Moreover, new infill sampling criterion designed based on set reference vectors select promising samples training models. validate generality effectiveness our three state-of-the-art [nondominated sorting genetic algorithm III (NSGA-III), decomposition differential evolution (MOEA/D-DE) vector-guided (RVEA)] embedded, significantly improve their solving most test adopted article. When compared some competitive up 30 variables, experimental results also advantages approach cases.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Evolutionary Optimization of Computationally Expensive Problems via Surrogate Modeling

We present a parallel evolutionary optimization algorithm that leverages surrogate models for solving computationally expensive design problems with general constraints, on a limited computational budget. The essential backbone of our framework is an evolutionary algorithm coupled with a feasible sequential quadratic programming solver in the spirit of Lamarckian learning.We employ a trust-regi...

متن کامل

A multiagent evolutionary framework based on trust for multiobjective optimization

In an Evolutionary Algorithm (EA) for optimization problems, candidate solutions to the problems are individuals in a population. They produce offsprings by taking evolutionary operators with user-specific control parameters. The challenge is then how to effectively select evolutionary operators and adjust control parameters from generation to generation and on different problems. We propose a ...

متن کامل

Evolutionary Multiobjective Optimization for Generating an Ensemble of Fuzzy Rule-Based Classifiers

One advantage of evolutionary multiobjective optimization (EMO) algorithms over classical approaches is that many non-dominated solutions can be simultaneously obtained by their single run. In this paper, we propose an idea of using EMO algorithms for constructing an ensemble of fuzzy rule-based classifiers with high diversity. The classification of new patterns is performed based on the vote o...

متن کامل

RBF-based surrogate model for evolutionary optimization

Many today’s engineering tasks use approximation of their expensive objective function. Surrogate models, which are frequently used for this purpose, can save significant costs by substituting some of the experimental evaluations or simulations needed to achieve an optimal or near-optimal solution. This paper presents a surrogate model based on RBF networks. In contrast to the most of the surro...

متن کامل

Surrogate based Evolutionary Algorithm for Design Optimization

Optimization is often a critical issue for most system design problems. Evolutionary Algorithms are population-based, stochastic search techniques, widely used as efficient global optimizers. However, finding optimal solution to complex high dimensional, multimodal problems often require highly computationally expensive function evaluations and hence are practically prohibitive. The Dynamic App...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Evolutionary Computation

سال: 2022

ISSN: ['1941-0026', '1089-778X']

DOI: https://doi.org/10.1109/tevc.2021.3103936